Conservative Groupoids Recognize Only Regular Languages
نویسندگان
چکیده
The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation ‘ · ’ which is not necessarily associative. It is well known that L can be recognized by a groupoid iff L is context-free. But it is also known that some subclasses of groupoids can only recognize regular languages. For example, loops recognize exactly the regular open languages and Beaudry et al. described the largest class of groupoids known to recognize only regular languages. A groupoid H is said to be conservative if a · b is in {a, b} for all a, b in H. The main result of this paper is that conservative groupoids can only recognize regular languages. This class is incomparable with the one of Beaudry et al. so we are exhibiting a new sense in which a groupoid can be too weak to have context-free capabilities.
منابع مشابه
The Complexity of Computing over Quasigroups
In 7] the notions of recognition by semigroups and by programs over semigroups were extended to groupoids. This led to a new characterization of the context-free languages and the class SAC 1. In this paper, we investigate the classes of languages obtained when the groupoids are restricted to be quasigroups (i.e. the multiplication table forms a latin square). We prove that languages recognized...
متن کاملOn Ideal Elements in Poe-AG-groupoid
In this paper we introduce the concept of ideal elements in poe-AG-groupoid and give some characterizations and properties of their ideal elements. So we consider some results concerning ideals in poe-semigroups and investigate them in poe-AG-groupoids. Also, the class of ideal elements of poe-AG-groupoids are studied, certain intrinsic and basic properties of poe-AG-groupoids including: ideal,...
متن کاملSome Characterizations of Intra-regular Abel-Grassmann Groupoids
Abstract: In this study we introduce a new class of a non-associative algebraic structure namely intra-regular Abel Grassmann's groupoid (AG-groupoid in short). We apply generalized fuzzy ideal theory to this class and discuss its related properties. We introduce ) , ( k q ∨ ∈ ∈ -fuzzy semiprime ideals in AG-groupoids and characterize it. Specifically we have characterized intra-regular AG-grou...
متن کاملDecidable and Expressive Classes of Probabilistic Automata
Hierarchical probabilistic automata (HPA) are probabilistic automata whose states are partitioned into levels such that for any state and input symbol, at most one transition with non-zero probability goes to a state at the same level, and all others go to states at a higher level. We present expressiveness and decidability results for 1-level HPAs that work on both finite and infinite length i...
متن کامل